A New Approach to Solving Stochastic Optimal Control Problems
نویسندگان
چکیده
منابع مشابه
A new approach for solving of optimal nonlinear control problems
In this paper, we are going to consider a nonlinear optimal control problem (NOC). First we change the (NOC) problem to an optimal differential inclusion problem (ODI), then by defining new control variables, (ODI) problem is converted to an optimal control problem where it is linear in term of control variable and we determine the approximation of this control problem, then by using measure th...
متن کاملSolving optimal control problems by PSO-SVM
The optimal control of problem is about finding a control law for a given system such that a certain optimality criterion is achieved. Methods of solving the optimal control problems are divided into direct methods and mediated methods (through other equations). In this paper, the PSO- SVM indirect method is used to solve a class of optimal control problems. In this paper, we try to determine t...
متن کاملA New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کاملA Method for Solving Optimal Control Problems Using Genetic Programming
This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2019
ISSN: 2227-7390
DOI: 10.3390/math7121207